Distributed Biased Min-Consensus With Applications to Shortest Path Planning

Direction Weighted Shortest Path Planning

Distributed Path Consensus Algorithm

Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...

Shortest Path Problem with Gamma Probability Distribution Arc Length

We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.

Min-Link Shortest Path Maps and Fréchet Distance

We present shortest path maps that support min-link queries from any source point on a line segment to destination points in either a simple polygon or a polygonal domain (a polygon with holes). These structures are more versatile than the traditional shortest path map from a fixed source point, and we use them to compute the min-link Fréchet distance between two polygonal curves. In addition t...

Planning wireless networks by shortest path

Transmitters and receivers are the basic elements of wireless networks and are characterized by a number of radio-electrical parameters. A general planning problem consists in establishing suitable values for these parameters so as to optimize some network performance indicator. In this paper we consider a version of the problem called the Power Assignment Problem (PAP), that is the problem of ...